Pure Mathematics in a Mechanized Logic
نویسنده
چکیده
It is widely believed that in principle it’s possible to reduce most of present-day mathematics to reasoning in a formal logical system. The technical difficulty of actually doing so is quite formidable. However, the arrival of the computer is changing this situation, since computers are good at helping with such tedious symbolic manipulation. The computer formalization of mathematics is now a popular research topic. Here we report on our own development of mathematical analysis starting just from the axioms of simple type theory and reducing all reasoning (with the aid of the computer) to a formal deductive calculus of great simplicity.
منابع مشابه
Linear Formulas in Continuous Logic
We prove that continuous sentences preserved by the ultramean construction (a generalization of the ultraproduct construction) are exactly those sentences which are approximated by linear sentences. Continuous sentences preserved by linear elementary equivalence are exactly those sentences which are approximated in the Riesz space generated by linear sentences. Also, characterizations for linea...
متن کاملMathScheme: Project Description
The mission of mechanized mathematics is to develop software systems that support the process people use to create, explore, connect, and apply mathematics. Working mathematicians routinely leverage a powerful synergy between deduction and computation. The artificial division between (axiomatic) theorem proving systems and (algorithmic) computer algebra systems has broken this synergy. To signi...
متن کاملMechanizing the Traditional Approach to Partial Functions
In traditional mathematics it is legitimate to apply a (partial) function to an argument outside of its domain, but the resulting term is treated as having no value. Moreover, the informal logic of traditional mathematics is two-valued despite the presence of nondenoting terms. This paper shows how this traditional approach to partial functions can be implemented in mechanized mathematics systems.
متن کاملInductive Fixpoints in Higher Order Logic
We show that an analogue of the domain-theoretic least fixpoint operator can be defined in a purely set-theoretic framework. It can be formalized in classical higher order logic, serving as a solid foundation for proving termination of (possibly nested) recursive programs in a variety of mechanized proof systems.
متن کاملManfred Kerber Proof Planning: a Practical Approach to Mechanized Reasoning in Mathematics
The attempt to mechanize mathematical reasoning belongs to the first experiments in artificial intelligence in the 1950 (Newell et al., 1957). However, the idea to automate or to support deduction turned out to be harder than originally expected. This can not at least be seen in the multitude of approaches that were pursued to model different aspects of mathematical reasoning. There are differe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007